Randomized algorithms - PDFSEARCH.IO - Document Search Engine

Randomized algorithms
Results: 419

#	Item
331	November 8, S0129054110007635[removed]:45 WSPC/INSTRUCTION Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2010-12-13 06:54:39 NP-complete problems Matching Analysis of algorithms Graph coloring Combinatorial optimization Independent set Hypergraph Randomized algorithm Induced path Graph theory Theoretical computer science Mathematics
332	Collaboration of Untrusting Peers with Changing Interests (Extended Abstract) Baruch Awerbuch∗ Boaz Patt-Shamir† Add to Reading List Source URL: www.markrtuttle.com Language: English - Date: 2007-04-26 00:00:00 Applied mathematics Computer science Mathematics Analysis of algorithms Probabilistic complexity theory Randomized algorithm
333	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-30 06:01:55 Algorithms Linear programming Randomized rounding Probabilistic complexity theory Linear programming relaxation Randomized algorithm Approximation algorithm David Shmoys Theoretical computer science Mathematics Applied mathematics
334	Quantiles on Streams Chiranjeeb Buragohain Amazon.com Seattle, WA 98104, USA [removed] Add to Reading List Source URL: www.cs.ucsb.edu Language: English - Date: 2007-11-13 12:48:45 Applied mathematics Analysis of algorithms Quantile Order statistic Streaming algorithm Time complexity Algorithm Randomized algorithm Q-Q plot Theoretical computer science Statistics Summary statistics
335	Ch 6 Randomized algorithms Ecclesiastes: .. and saw under the sun, that the race is not to the swift, nor the battle to the strong, neither yet bread to the wise, Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-04-08 10:39:46 Information science Artificial intelligence Hash table Hash function Open addressing Coalesced hashing Double hashing Linear probing Cryptographic hash function Hashing Search algorithms Information retrieval
336	INDEX Next Fit, 4{5, 25, 27{30 Smart, 28, 30 Next Fit Decreasing, 17, 41, 44 Next-K Fit, 5, 9{11, 25, 28 Add to Reading List Source URL: www.math.nsc.ru Language: English - Date: 2005-03-04 05:08:14 Analysis of algorithms Operations research Convex optimization Bin packing problem Discrete geometry Combinatorial optimization Packing problem Linear programming Randomized algorithm Theoretical computer science Mathematics Computational complexity theory
337	A Quadratic Regulator-Based Heuristic for Rapidly Exploring State Space Elena Glassman and Russ Tedrake Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of findin Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2013-02-21 10:13:09 Geometry Optimal control Mathematical optimization Metric geometry Rapidly-exploring random tree Robot control Metric A* search algorithm Dynamic programming Mathematics Control theory Search algorithms
338	CONSTRUCTING RANDOM SAMPLE PARALLEL LOGIC CONTROL ALGORITHMS Eduard I. Vatutin Department of Computer Science Kursk State Technical University 50 Let Oktyabrya, 94, 305040, RUSSIA Add to Reading List Source URL: evatutin.narod.ru Language: English - Date: 2013-04-08 20:19:46 Mathematical logic Theoretical computer science Randomized algorithm Autostrade of Italy Computer science Applied mathematics Mathematics Algorithm
339	Optimal heuristic algorithms for the image of an injective function∗ Edward A. Hirsch† Dmitry Itsykson† Valeria Nikolaenko‡ Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2011-08-01 04:42:41 Complexity classes Analysis of algorithms Quantum complexity theory Probabilistic complexity theory Randomized algorithm NP PP Algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
340	On an optimal randomized acceptor for graph nonisomorphism∗ Edward A. Hirsch†,‡ Dmitry Itsykson† November 9, 2011 Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2011-11-09 06:46:56 Analysis of algorithms Mathematical optimization Complexity classes Graph coloring NP-complete Randomized algorithm P versus NP problem NP Time complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE